Eigenvalue asymptotics for a class of multi-variable Hankel matrices
نویسندگان
چکیده
Abstract A one-variable Hankel matrix H a {H}_{a} is an infinite = [ ( i + j ) ] , ≥ 0 {H}_{a}={\left[a\left(i+j)]}_{i,j\ge 0} . Similarly, for any d 2 d\ge 2 , a d -variable defined as a mathvariant="bold">i mathvariant="bold">j {H}_{{\bf{a}}}=\left[{\bf{a}}\left({\bf{i}}+{\bf{j}})] where 1 … {\bf{i}}=\left({i}_{1},\ldots ,{i}_{d}) and {\bf{j}}=\left({j}_{1},\ldots ,{j}_{d}) with , {i}_{1},\ldots ,{i}_{d},{j}_{1},\ldots ,{j}_{d}\ge 0 For γ > \gamma \gt Pushnitski Yafaev proved that the eigenvalues of compact matrices − log a\left(j)={j}^{-1}{\left(\log j)}^{-\gamma } j\ge obey asymptotics λ n ∼ C {\lambda }_{n}\left({H}_{a})\hspace{0.33em} \sim \hspace{0.33em}{C}_{\gamma }{n}^{-\gamma → ∞ n\to +\infty constant {C}_{\gamma calculated explicitly. This article presents following analogue. Let a\left(j)={j}^{-d}{\left(\log If ⋯ {\bf{a}}\left({j}_{1},\ldots ,{j}_{d})=a\left({j}_{1}+\cdots +{j}_{d}) then {H}_{{\bf{a}}} its follow }_{n}\left({H}_{{\bf{a}}})\hspace{0.33em} \hspace{0.33em}{C}_{d,\gamma {C}_{d,\gamma
منابع مشابه
The smallest eigenvalue of Hankel matrices
Let HN = (sn+m), n,m ≤ N denote the Hankel matrix of moments of a positive measure with moments of any order. We study the large N behaviour of the smallest eigenvalue λN of HN . It is proved that λN has exponential decay to zero for any measure with compact support. For general determinate moment problems the decay to 0 of λN can be arbitrarily slow or arbitrarily fast. In the indeterminate ca...
متن کاملComputing the smallest eigenvalue of large ill-conditioned Hankel matrices
This paper presents a parallel algorithm for finding the smallest eigenvalue of a particular form of ill-conditioned Hankel matrix, which requires the use of extremely high precision arithmetic. Surprisingly, we find that commonly-used approaches that are designed for high efficiency are actually less efficient than a direct approach under these conditions. We then develop a parallel implementa...
متن کاملAsymptotics of Large Eigenvalues for a Class of Band Matrices
We investigate the asymptotic behaviour of large eigenvalues for a class of finite difference self-adjoint operators with compact resolvent in l2.
متن کاملAnalysis of a Fast Hankel Eigenvalue Algorithm
This paper analyzes the important steps of an O(n 2 log n) algorithm for nding the eigenvalues of a complex Hankel matrix. The three key steps are a Lanczos-type tridiagonalization algorithm, a fast FFT-based Hankel matrix-vector product procedure, and a QR eigenvalue method based on complex-orthogonal transformations. In this paper, we present an error analysis of the three steps, as well as r...
متن کاملDeterminants of Hankel Matrices
The purpose of this paper is to compute asymptotically Hankel determinants for weights that are supported in a semi-infinite interval. The main idea is to reduce the problem to determinants of other operators whose determinant asymptotics are well known.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Concrete Operators
سال: 2023
ISSN: ['2299-3282']
DOI: https://doi.org/10.1515/conop-2022-0137